LAB Mode for Iterated Hash Functions
نویسنده
چکیده
In this paper,we proposed a efficient and laconic mode for iterative hash functions and tried to fix the flaws of the Merkle-Damgaard construction completely and certainly tried to prevent varieties of those generic attacks ,such as Multicollisions Attack,Second Preimage Attack and Herding Attack.The structure of this new mode is different from HAIFA or any other proposal,it contains a new method “Locking Abutting Blocks”(LAB)with checksum ,it makes a large size of connotative chaining value without requirements of intricate computing and large memory and it allows for an online computation in one pass with a fixed memory independently .It’s also easy to avoid the generic attacks (presented by Praveen Gauravaram and John Kelsey) which apply on the hash functions with linear-XOR/additive checksum. . keywords: hash function ,iterating ,abutting blocks,effectual chaining variable, checksum blocks
منابع مشابه
LAB Mode for Iterated Hash Functions
In this paper,we proposed a efficient and laconic mode for iterative hash functions and tried to fix the flaws of the Merkle-Damgaard construction completely and certainly tried to prevent varieties of those generic attacks ,such as Multicollisions Attack,Second Preimage Attack and Herding Attack.The structure of this new mode is different from HAIFA or any other proposal,it contains a new meth...
متن کاملEfficient Pseudorandom-Function Modes of a Block-Cipher-Based Hash Function
This article discusses the provable security of pseudorandom-function (PRF) modes of an iterated hash function using a block cipher. The iterated hash function uses the Matyas-Meyer-Oseas (MMO) mode for the compression function and the Merkle-Damgård with a permutation (MDP) for the domain extension transform. It is shown that the keyed-via-IV mode and the key-prefix mode of the iterated hash f...
متن کامل3C- A Provably Secure Pseudorandom Function and Message Authentication Code.A New mode of operation for Cryptographic Hash Function
We propose a new cryptographic construction called 3C, which works as a pseudorandom function (PRF), message authentication code (MAC) and cryptographic hash function. The 3Cconstruction is obtained by modifying the Merkle-Damg̊ard iterated construction used to construct iterated hash functions. We assume that the compression functions of Merkle-Damg̊ard iterated construction realize a family of ...
متن کاملCRUSH: A New Cryptographic Hash Function using Iterated Halving Technique
Most of the currently accepted designs for cryptographic hash functions are in the style of a block cipher in feed-forward mode. With increasing interest in all forms of cryptanalysis, this limited choice might become a single point of failure in computer security, and so we seek alternative paradigms. In this paper an entirely new approach, based on iterated halving (IH), is proposed for the d...
متن کاملProvable Second Preimage Resistance Revisited
Most cryptographic hash functions are iterated constructions, in which a mode of operation specifies how a compression function or a fixed permutation is applied. The Merkle-Damg̊ard mode of operation is the simplest and more widely deployed mode of operation, yet it suffers from generic second preimage attacks, even when the compression
متن کامل